On the P3 Coloring of Graphs

The vertex coloring of graphs is a well-known graphs. In this coloring, all the vertices are assigned colors in such way that no two adjacent have same color. We can call type P2 where path graph. However, there situations which cannot give us solution to problem at hand. To answer questions, article, we introduce novel graph called P3 coloring. A P3-colorable if assign every distinct. minimum number required for chromatic number. aim article is, general, prove some basic results concerning and, particular, compute different symmetric families